The complexity of recursion theoretic games
نویسندگان
چکیده
منابع مشابه
The Complexity of Recursion Theoretic Games
We show that some natural games introduced by Lachlan in 1970 as a model of recursion theoretic constructions are undecidable, contrary to what was previously conjectured. Several consequences are pointed out; for instance, the set of all Π2-sentences that are uniformly valid in the lattice of recursively enumerable sets is undecidable. Furthermore we show that these games are equivalent to nat...
متن کاملRecursion Theoretic Operators for Function Complexity Classes
We characterize the gap between time and space complexity of functions by operators and completeness. First, we introduce a new notion of operators for function complexity classes based on recursive function theory and construct an operator which generates FPSPACE from FP . Then, we introduce new function classes composed of functions whose output lengths are bounded by the input length plus so...
متن کاملRecursion Theoretic Characterizations of Complexity Classes of Counting Functions
There has been a great eeort in giving machine independent, algebraic characterizations of complexity classes, especially of functions. Astonishingly, no satisfactory characterization of the prominent class # P has been known up to now. Here, we characterize # P as the closure of a set of simple arithmetical functions under summation and weak product. Building on that result, the hierarchy of c...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولOn the Recursion-Theoretic Complexity of Relative Succinctness of Representations of Languages
In Hartmanis (1980) a simple proof is given of the fact (originally proved in Valiant (1976)) that the relative succinctness of representing deterministic context-free languages by deterministic vs. nondeterministic pushdown automata is not recursively bounded, in the following sense: there is no recursive function which, for deterministic context-free languages L, can bound the size of the min...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2005
ISSN: 0002-9947,1088-6850
DOI: 10.1090/s0002-9947-05-04074-2